3 research outputs found
On the Connectivity of Unions of Random Graphs
Graph-theoretic tools and techniques have seen wide use in the multi-agent
systems literature, and the unpredictable nature of some multi-agent
communications has been successfully modeled using random communication graphs.
Across both network control and network optimization, a common assumption is
that the union of agents' communication graphs is connected across any finite
interval of some prescribed length, and some convergence results explicitly
depend upon this length. Despite the prevalence of this assumption and the
prevalence of random graphs in studying multi-agent systems, to the best of our
knowledge, there has not been a study dedicated to determining how many random
graphs must be in a union before it is connected. To address this point, this
paper solves two related problems. The first bounds the number of random graphs
required in a union before its expected algebraic connectivity exceeds the
minimum needed for connectedness. The second bounds the probability that a
union of random graphs is connected. The random graph model used is the
Erd\H{o}s-R\'enyi model, and, in solving these problems, we also bound the
expectation and variance of the algebraic connectivity of unions of such
graphs. Numerical results for several use cases are given to supplement the
theoretical developments made.Comment: 16 pages, 3 tables; accepted to 2017 IEEE Conference on Decision and
Control (CDC
Figs 44 - 48 in Pholcid spiders from the Lower Guinean region of Central Africa: an overview, with descriptions of seven new species (Araneae, Pholcidae)
Figs 44 - 48. Leptopholcus gabonicus sp. nov. 44. β, dorsal view. 45. β prosoma and palps, dorsal view. 46 - 47. Left β palp, prolateral and retrolateral views. 48. β epigynum, ventral view